On approximation by projections of polytopes with few facets
نویسندگان
چکیده
We provide an affirmative answer to a problem posed by Barvinok and Veomett in [4], showing that in general an n-dimensional convex body cannot be approximated by a projection of a section of a simplex of sub-exponential dimension. Moreover, we prove that for all 1 ≤ n ≤ N there exists an n-dimensional convex body B such that for every n-dimensional convex body K obtained as a projection of a section of an N -dimensional simplex one has d(B,K) ≥ c √ n ln 2N ln(2N) n , where d(·, ·) denotes the Banach-Mazur distance and c is an absolute positive constant. The result is sharp up to a logarithmic factor. 2010 Subject Classification: Primary: 52A23, 52A27; Secondary: 52B55, 46B09.
منابع مشابه
Deriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes
Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, Imm22, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the case of 2 parties each with 10 2-valued o...
متن کاملExtension complexity of polytopes with few vertices or facets
We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of d-polytopes with at most d + 4 vertices according to their extension complexity: Out of the super-exponentially many d-polytopes with d+4 vertices, all have extension complexity d+ 4 except for some families of size θ(d). On the other hand, we show that generic re...
متن کاملAn FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes
Given an n-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio (n/ logn). There is a substantial progress on randomized approximation such as Markov chain Monte Carlo for a highdimensional volume, and for many #P-hard problems, while some deterministic approximation algorithms are rece...
متن کاملAsymptotic approximation of smooth convex bodies by general polytopes
For the optimal approximation of convex bodies by inscribed or circumscribed polytopes there are precise asymptotic results with respect to different notions of distance. In this paper we want to derive some results on optimal approximation without restricting the polytopes to be inscribed or circumscribed. Let Pn and P(n) denote the set of polytopes with at most n vertices and n facets, respec...
متن کاملApproximation of convex bodies and a momentum lemma for power diagrams
Let C be a convex body in Euclidean d-space IE , i.e., a compact convex set with non-empty interior, and denote by P i n and P (n) the set of polytopes with at most n vertices inscribed to C and the set of polytopes with at most n facets circumscribed to C, respectively. Denote by δ(., .) the symmetric difference metric. Beginning with the work of L. Fejes Tóth [2], there are many investigation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013